Well-posedness and scattering for the KP-II equation in a critical space

The Cauchy problem for the Kadomtsev-Petviashvili-II equation (u_t+u_{xxx}+uu_x)_x+u_{yy}=0 is considered. A small data global well-posedness and scattering result in the scale invariant, non-isotropic, homogeneous Sobolev space \dot H^{-1/2,0}(R^2) is derived. Additionally, it is proved that for arbitrarily large initial data the Cauchy problem is locally well-posed in the homogeneous space \dot H^{-1/2,0}(R^2) and in the inhomogeneous space H^{-1/2,0}(R^2), respectively.Comment: 28 pages; v3: erratum include

Dispersive regime of the Jaynes-Cummings and Rabi lattice

Photon-based strongly-correlated lattice models like the Jaynes-Cummings and Rabi lattices differ from their more conventional relatives like the Bose-Hubbard model by the presence of an additional tunable parameter: the frequency detuning between the pseudo-spin degree of freedom and the harmonic mode frequency on each site. Whenever this detuning is large compared to relevant coupling strengths, the system is said to be in the dispersive regime. The physics of this regime is well-understood at the level of a single Jaynes-Cummings or Rabi site. Here, we extend the theoretical description of the dispersive regime to lattices with many sites, for both strong and ultra-strong coupling. We discuss the nature and spatial range of the resulting qubit-qubit and photon-photon coupling, demonstrate the emergence of photon- pairing and squeezing, and illustrate our results by exact diagonalization of the Rabi dimer.Comment: 22 pages, 7 figures, 1 table, Published by NJP, Focus Issues "Focus on Quantum Microwave Field Effects in Superconducting Circuits

The time of graph bootstrap percolation

Graph bootstrap percolation, introduced by Bollob\'as in 1968, is a cellular automaton defined as follows. Given a "small" graph $H$ and a "large" graph $G = G_0 \subseteq K_n$, in consecutive steps we obtain $G_{t+1}$ from $G_t$ by adding to it all new edges $e$ such that $G_t \cup e$ contains a new copy of $H$. We say that $G$ percolates if for some $t \geq 0$, we have $G_t = K_n$. For $H = K_r$, the question about the size of the smallest percolating graphs was independently answered by Alon, Frankl and Kalai in the 1980's. Recently, Balogh, Bollob\'as and Morris considered graph bootstrap percolation for $G = G(n,p)$ and studied the critical probability $p_c(n,K_r)$, for the event that the graph percolates with high probability. In this paper, using the same setup, we determine, up to a logarithmic factor, the critical probability for percolation by time $t$ for all $1 \leq t \leq C \log\log n$.Comment: 18 pages, 3 figure

Subgraphs and Colourability of Locatable Graphs

We study a game of pursuit and evasion introduced by Seager in 2012, in which a cop searches the robber from outside the graph, using distance queries. A graph on which the cop wins is called locatable. In her original paper, Seager asked whether there exists a characterisation of the graph property of locatable graphs by either forbidden or forbidden induced subgraphs, both of which we answer in the negative. We then proceed to show that such a characterisation does exist for graphs of diameter at most 2, stating it explicitly, and note that this is not true for higher diameter. Exploring a different direction of topic, we also start research in the direction of colourability of locatable graphs, we also show that every locatable graph is 4-colourable, but not necessarily 3-colourable.Comment: 25 page

Cracking the role of cocaine in stroke

No abstract available

Linear Programming for a Cutting Problem in the Wood Processing Industry – A Case Study

In this paper the authors present a case study from the wood-processing industry. It focuses on a cutting process in which material from stock is cut down in order to provide the items required by the customers in the desired qualities, sizes, and quantities. In particular, two aspects make this cutting process special. Firstly, the cutting process is strongly interdependent with a preceding handling process, which, consequently, cannot be planned independently. Secondly, if the trim loss is of a certain minimum size, it can be returned into stock and used as input to subsequent cutting processes. In order to reduce the cost of the cutting process, a decision support tool has been developed which incorporates a linear programming model as a central feature. The model is described in detail, and experience from the application of the tool is reported.one-dimensional cutting, linear programming, wood-processing industry

Subdivisions in the Robber Locating Game

We consider a game in which a cop searches for a moving robber on a graph using distance probes, which is a slight variation on one introduced by Seager. Carragher, Choi, Delcourt, Erickson and West showed that for any n-vertex graph $G$ there is a winning strategy for the cop on the graph $G^{1/m}$ obtained by replacing each edge of $G$ by a path of length $m$, if $m \geqslant n$. They conjectured that this bound was best possible for complete graphs, but the present authors showed that in fact the cop wins on $K^{1/m}$ if and only if $m \geqslant n/2$, for all but a few small values of $n$. In this paper we extend this result to general graphs by proving that the cop has a winning strategy on $G^{1/m}$ provided $m \geqslant n/2$ for all but a few small values of $n$; this bound is best possible. We also consider replacing the edges of $G$ with paths of varying lengths.Comment: 13 Page